A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem
نویسندگان
چکیده
منابع مشابه
A Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow-shop scheduling problem (PFSP) with the minimizing makespan measure. The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles. In the first phase, t...
متن کاملA novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem
Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...
متن کاملA Discrete Particle Swarm Optimization with Combined Priority Dispatching Rules for Hybrid Flow Shop Scheduling Problem
In this paper, an algorithm based on particle swarm optimization is proposed, for hybrid flow shop scheduling problem, to minimize the makespan. First an effective new approach using two decisions based on parallel priority dispatching rules is applied. Next we develop an hybridizing DPSO, that presents new components to updating velocity and position using genetic operators, with an adaptive n...
متن کاملA Multi-Layer Hybrid Particle Swarm Optimization Model for Flow Shop Scheduling Problem
ing is permitted with due credit to the Australian Journal of Intelligent Information Processing Systems. Subscriptions: Individual rate: A$80. Institutional rate: A$220 for paper or online subscription. Individual copies can be purchased at A$15 per single copy. Reprints of technical articles are available, quantities no less than 50 can be ordered. Orders should be addressed to: AJIIPS, Facul...
متن کاملA Niche Sharing Scheme-based Co-evolutionary Particle Swarm Optimization Algorithm for Flow Shop Scheduling Problem
By taking advantage of niche sharing scheme,we propose a novel co-evolutionary particle swarm optimization algorithm (NCPSO) to solve permutation flow shop scheduling problem. As the core of this algorithm, niche sharing scheme maximizes the diversity of population and hence improves the quality of individuals. To evaluate the performance of the proposed algorithm, we have use eight Taillard in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2011
ISSN: 1026-3098
DOI: 10.1016/j.scient.2011.05.023